Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
+(-(x, y), z) → -(+(x, z), y)
-(+(x, y), y) → x
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
+(-(x, y), z) → -(+(x, z), y)
-(+(x, y), y) → x
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
[+2, -2]
Status: +2: [1,2]
-2: [2,1]